Distributionally Robust Control of Constrained Stochastic Systems
نویسندگان
چکیده
منابع مشابه
Distributionally Robust Stochastic Programming
Abstract. In this paper we study distributionally robust stochastic programming in a setting 7 where there is a specified reference probability measure and the uncertainty set of probability mea8 sures consists of measures in some sense close to the reference measure. We discuss law invariance of 9 the associated worst case functional and consider two basic constructions of such uncertainty set...
متن کاملDistributionally Robust Stochastic Programming
Abstract. In this paper we study distributionally robust stochastic programming in a setting 7 where there is a specified reference probability measure and the uncertainty set of probability mea8 sures consists of measures in some sense close to the reference measure. We discuss law invariance of 9 the associated worst case functional and consider two basic constructions of such uncertainty set...
متن کاملDistributionally Robust Stochastic Knapsack Problem
This paper considers a distributionally robust version of a quadratic knapsack problem. In this model, a subsets of items is selected to maximizes the total profit while requiring that a set of knapsack constraints be satisfied with high probability. In contrast to the stochastic programming version of this problem, we assume that only part of information on random data is known, i.e., the firs...
متن کاملDistributionally robust chance-constrained linear programs
In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that for a wide class of probability distributions (i.e. radial distributions) on the data, the probability constraints can be explicitly converted into convex second...
متن کاملKullback-Leibler Divergence Constrained Distributionally Robust Optimization
In this paper we study distributionally robust optimization (DRO) problems where the ambiguity set of the probability distribution is defined by the Kullback-Leibler (KL) divergence. We consider DRO problems where the ambiguity is in the objective function, which takes a form of an expectation, and show that the resulted minimax DRO problems can be formulated as a one-layer convex minimization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2015
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2015.2444134